A model of random industrial SAT
نویسندگان
چکیده
One of the most studied models SAT is random SAT. In this model, instances are composed from clauses chosen uniformly randomly and independently each other. This model may be unsatisfactory in that it fails to describe various features instances, arising real-world applications. Various modifications have been suggested define industrial Here, we focus mainly on aspect community structure. Namely, here set variables consists a number disjoint communities, tend consist same community. Thus, suggest SAT, which central generalization with respect additional There has lot work satisfiability threshold k-SAT, starting calculation 2-SAT, up recent result exists for sufficiently large k. paper, endeavor study proposed Our main tends smaller than its counterpart Moreover, under some conditions, even vanishes.
منابع مشابه
Pseudo-Industrial Random SAT Generators
Recent advances in SAT are focused on efficiently solving real-world or industrial problems. However, the reduced number of industrial SAT instances and the high cost of solving them condition the development and debugging processes of new techniques. This problem can be solved by defining new models of random SAT instance that capture realistically the main features of the real-world SAT insta...
متن کاملTowards Industrial-Like Random SAT Instances
We focus on the random generation of SAT instances that have computational properties that are similar to real-world instances. It is known that industrial instances, even with a great number of variables, can be solved by a clever solver in a reasonable amount of time. This is not possible, in general, with classical randomly generated instances. We provide different generation models of SAT i...
متن کاملTowards Industrial-Like Random SAT Instances
We focus on the random generation of SAT instances that have computational properties that are similar to real-world instances. It is known that industrial instances, even with a great number of variables, can be solved by a clever solver in a reasonable amount of time. This is not possible, in general, with classical randomly generated instances. We provide different generation models of SAT i...
متن کاملOn an online random k-SAT model
Given n Boolean variables x1, . . . , xn, a k-clause is a disjunction of k literals, where a literal is a variable or its negation. Suppose random k-clauses are generated one at a time and an online algorithm accepts or rejects each clause as it is generated. Our goal is to accept as many randomly generated k-clauses as possible with the condition that it must be possible to satisfy every claus...
متن کاملinvestigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2022
ISSN: ['1879-2294', '0304-3975']
DOI: https://doi.org/10.1016/j.tcs.2022.01.038